Competitive Equilibria for Non-quasilinear Bidders in Combinatorial Auctions

نویسندگان

  • Rad Niazadeh
  • Christopher A. Wilkens
چکیده

Quasiliearity is a ubiquitous and questionable assumption in the standard study of Walrasian equilibria. Quasilinearity implies that a buyer’s value for goods purchased in a Walrasian equilibrium is always additive with goods purchased with unspent money. It is a particularly suspect assumption in combinatorial auctions, where buyers’ complex preferences over goods would naturally extend beyond the items obtained in the Walrasian equilibrium. We study Walrasian equilibria in combinatorial auctions when quasilinearity is not assumed. We show that existence can be reduced to an Arrow-Debreu style market with one divisible good and many indivisible goods, and that a “fractional” Walrasian equilibrium always exists. We also show that standard integral Walrasian equilibria are related to integral solutions of an induced configuration LP associated with a fractional Walrasian equilibrium, generalizing known results for both quasilinear and non-quasilnear settings.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

Coordination and Pricing in Multi-Object Auctions

Much research has focused on the design of efficient combinatorial auctions. Recent gametheoreticalwork highlights that strategy-proof ascendingmechanisms for general valuations are impossible due to inherent free-rider problems in specific situations. We argue that these negative results are due to assumptions in Bayesian games which typically do not hold in online combinatorial auctions. Howe...

متن کامل

Bidding Lower with Higher Values in Multi-Object Auctions

Multi-object auctions differ in an important way from single-object auctions. When bidders have multi-object demand, equilibria can exist in which bids decrease as values increase! Consider a model with n bidders who receive affiliated one-dimensional types t and whose marginal values are non-decreasing in t and strictly increasing in own type ti. In the first-price auction of a single object, ...

متن کامل

Coalition-Based Pricing in Ascending Combinatorial Auctions

Bidders in larger ascending combinatorial auctions face a substantial coordination problem, which has received little attention in the literature. The coordination problem manifests itself by the fact that losing bidders need to submit non-overlapping package bids which are high enough to outbid the standing winners. We propose an auction format, which leverages the information that the auction...

متن کامل

Spiteful Bidding in Sealed-Bid Auctions

We study the bidding behavior of spiteful agents who, contrary to the common assumption of selfinterest, maximize the weighted difference of their own profit and their competitors’ profit. This assumption is motivated by inherent spitefulness, or, for example, by competitive scenarios such as in closed markets where the loss of a competitor will likely result in future gains for oneself. We der...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016